Cramer–Damgård signatures revisited: Efficient flat-tree signatures based on factoring
نویسندگان
چکیده
منابع مشابه
Cramer-Damgård Signatures Revisited: Efficient Flat-Tree Signatures Based on Factoring
At Crypto 96 Cramer and Damg̊ard proposed an efficient, tree-based, signature scheme that is provably secure against adaptive chosen message attacks under the assumption that inverting RSA is computationally infeasible. In this paper we show how to modify their basic construction in order to achieve a scheme that is provably secure under the assumption that factoring large composites of a certai...
متن کاملTransitive Signatures Based on Factoring and RSA
We present novel realizations of the transitive signature primitive introduced by Micali andRivest [11]. Our first scheme, FBTS-1, is proven transitively unforgeable under adaptive chosen-message attack assuming factoring is hard. We then present a hash-based modification, FBTS-2achieving shorter signatures by eliminating the need for “node certificates”, and provable underthe s...
متن کاملCertificate-based Signatures Revisited
Certificate-based encryption was introduced in Eurocrypt’03 to solve the certificate management problem in public key encryption. Recently, this idea was extended to certificate-based signatures. Several new schemes and security models of certificate-based signatures have been proposed. In this paper, we first take a closer look at the certificate-based signature by comparing it with digital si...
متن کاملMeta-He digital signatures based on factoring and discrete logarithms
This study investigates all variations of the He’s digital signature scheme based on factoring and discrete logarithms. In contrast to three modular exponentiation computation, the optimal two schemes of generalized He’s signature verification reveals that only two modular exponentiation is needed for signature verification. Key-Words: Digital signature, Batch verify, Computation complexity.
متن کاملEfficient Fail-Stop Signatures from the Factoring Assumption
In this paper, we revisit the construction of fail-stop signatures from the factoring assumption. These signatures were originally proposed to provide information-theoretic-based security against forgeries. In contrast to classical signature schemes, in which signers are protected through a computational conjecture, fail-stop signature schemes protect the signers in an information theoretic sen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.10.029